Plausible Deniability Using Automated Linguistic Stegonagraphy

نویسندگان

  • Mark Chapman
  • George I. Davida
چکیده

Information hiding has several applications, one of which is to hide the use of cryptography. The Nicetext [5, 6] system introduced a method for hiding cryptographic information by converting cryptographic strings (random-looking) into “nice text” (namely innocuous looking). The system retains the ability to recover the original ciphertext from the generated text. Nicetext can hide both plaintext and cryptographic text. The purpose of such transformations are to mask ciphertext from anyone who wants to detect or censor encrypted communication, such as a corporation that may monitor, or censor, its employee private mail. Even if the message is identified as the output of Nicetext, the sender might claim that the input was simply a pseudo-random number source rather than ciphertext. This paper extends the Nicetext protocol to enable deniable cryptography/messaging using the concepts of plausible deniability [2, 7]. Deniability is derived from the fact that even if one is forced to reveal a key to the random string that “nice text” reverts to, the real cryptographic/plaintext messages may be stored within additional required sources of “randomness” in the extended protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-Way Indexing for Plausible Deniability in Censorship Resistant Storage

The fundamental requirement for censorship resistance is content discoverability — it should be easy for users to find and access documents, but not to discover what they store locally, to preserve plausible deniability. We describe a design for “one-way indexing” to provide plausibly-deniable content search and storage in a censorship resistant network without requiring outof-band communicatio...

متن کامل

Plausible Deniability

In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast channel summons one of the parties in a communication protocol to reveal their message (or signal vector). It is desirable that the summoned party have the option to reveal as little of the true message as possible by p...

متن کامل

On The Plausible Deniability Feature of Internet Protocols

We present an examination of a design feature named “plausible deniability” which has been widely adopted in key exchange protocols, in particular, in IKEv2 and in signature-based modes of IKE. We expose an authentication flaw in these modes of IKE and IKEv2 which is due in part to the presence of this plausible deniability feature. The flaw is also present in the protocols SIGMA [18] and Σ0, Σ...

متن کامل

A Novel Plausible Deniability Scheme in Secure Steganography

The goal of steganography is to avoid drawing suspicion to the transmission of a hidden message. If suspicion is raised, steganography may fail. The success of steganography depends on the secrecy of the action. If steganography is detected, the system will fail but data security depends on the robustness of the applied algorithm. In this paper, we propose a novel plausible deniability scheme i...

متن کامل

It wasn't me! Plausible Deniability in Web Search

Our ability to control the flow of sensitive personal information to online systems is key to trust in personal privacy on the internet. We ask how to detect, assess and defend user privacy in the face of search engine personalisation? We develop practical and scalable tools allowing a user to detect, assess and defend against threats to plausible deniability. We show that threats to plausible ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002